Color degree and heterochromatic cycles in edge-colored graphs
نویسندگان
چکیده
Given a graph G and an edge coloring C of G, a heterochromatic cycle of G is a cycle in which any pair of edges have distinct colors. Let dc(v), named the color degree of a vertex v, be the maximum number of distinct colored edges incident with v. In this paper, some color degree conditions for the existence of heterochromatic cycles are obtained.
منابع مشابه
Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs
Conditions for the existence of heterochromatic Hamiltonian paths and cycles in edge colored graphs arewell investigated in literature. A related problem in this domain is to obtain good lower bounds for the length of a maximum heterochromatic path in an edge colored graph G. This problem is also well explored by now and the lower bounds are often specified as functions of theminimumcolor degre...
متن کاملLong Heterochromatic Paths in Edge-Colored Graphs
Let G be an edge-colored graph. A heterochromatic path of G is such a path in which no two edges have the same color. dc(v) denotes the color degree of a vertex v of G. In a previous paper, we showed that if dc(v) ≥ k for every vertex v of G, then G has a heterochromatic path of length at least dk+1 2 e. It is easy to see that if k = 1, 2, G has a heterochromatic path of length at least k. Sait...
متن کاملColor degree and color neighborhood union conditions for long heterochromatic paths in edge - colored graphs ∗
Let G be an edge-colored graph. A heterochromatic (rainbow, or multicolored) path of G is such a path in which no two edges have the same color. Let d(v) denote the color degree and CN(v) denote the color neighborhood of a vertex v of G. In a previous paper, we showed that if d(v) ≥ k (color degree condition) for every vertex v of G, then G has a heterochromatic path of length at least ⌈ 2 ⌉, a...
متن کاملHeterochromatic Matchings in Edge-Colored Graphs
Let G be an (edge-)colored graph. A heterochromatic matching of G is a matching in which no two edges have the same color. For a vertex v, let d(v) be the color degree of v. We show that if d(v) ≥ k for every vertex v of G, then G has a heterochromatic matching of size ⌈ 5k−3 12 ⌉ . For a colored bipartite graph with bipartition (X,Y ), we prove that if it satisfies a Hall-like condition, then ...
متن کاملColor Degree Condition for Large Heterochromatic Matchings in Edge-Colored Bipartite Graphs
Let G = (V,E) be an edge-colored graph, i.e., G is assigned a surjective function C : E → {1, 2, · · · , r}, the set of colors. A matching of G is called heterochromatic if its any two edges have different colors. Let (B,C) be an edge-colored bipartite graph and d(v) be color degree of a vertex v. We show that if d(v) ≥ k for every vertex v of B, then B has a heterochromatic matching of cardina...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 33 شماره
صفحات -
تاریخ انتشار 2012